A note on the quickest minimum cost transshipment problem
نویسندگان
چکیده
Klinz and Woeginger (1995) prove that the minimum cost quickest flow problem is NP-hard. On other hand, can be solved efficiently via a straightforward reduction to without costs. More generally, we show how transshipment reduced solvable problem, thus adding another mosaic tile rich complexity landscape of flows over time.
منابع مشابه
The Quickest Transshipment Problem
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. Variations of th...
متن کاملFaster Algorithms for the Quickest Transshipment Problem
A transshipment problem with demands that exceed network capacity can be solved by sending ow in several waves. How can this be done in the minimum number of waves? This is the question tackled in the quickest transshipment problem. Hoppe and Tardos 10] describe the only known polynomial time algorithm to solve this problem. Their algorithm repeatedly minimizes submodular functions using the el...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملOn the Minimum Cost Range Assignment Problem
We study the problem of assigning transmission ranges to radio stations placed arbitrarily in a d-dimensional (d-D) Euclidean space in order to achieve a strongly connected communication network with minimum total power consumption. The power required for transmitting in range r is proportional to r, where α is typically between 1 and 6, depending on various environmental factors. While this pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2023
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2023.03.005